package 动态规划;

//583 两个字符串的删除操作 （编辑距离类型动归）
public class Solution14 {
    public int minDistance(String word1, String word2) {
        int m = word1.length();
        int n = word2.length();
        int[][] dp = new int[m+1][n+1];
        int ans = 1001;
        for(int i = 0 ; i <= m ; i++) dp[i][0] = i;
        for(int i = 0 ; i <= n ; i++) dp[0][i] = i;
        for(int i = 1 ; i <= m ; i++){
            for(int j = 1 ; j <=n ; j++){
                if(word1.charAt(i-1)==word2.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1];
                }else{
                    dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1])+1;
                }
            }
        }
        return dp[m][n];
    }
}
